An Empirical Evaluation of Preconditioning Data for Accelerating Convex Hull Computations
نویسندگان
چکیده
The convex hull describes the extent or shape of a set of data and is used ubiquitously in computational geometry. Common algorithms to construct the convex hull on a finite set of n points (x,y) range from O(nlogn) time to O(n) time. However, it is often the case that a heuristic procedure is applied to reduce the original set of n points to a set of s < n points which contains the hull and so accelerates the final hull finding procedure. We present an algorithm to precondition data before building a 2D convex hull with integer coordinates, with three distinct advantages. First, for all practical purposes, it is linear; second, no explicit sorting of data is required and third, the reduced set of s points is constructed such that it forms an ordered set that can be directly pipelined into an O(n) time convex hull algorithm. Under these criteria a fast (or O(n)) pre-conditioner in principle creates a fast convex hull (approximately O(n)) for an arbitrary set of points. The paper empirically evaluates and quantifies the acceleration generated by the method against the most common convex hull algorithms. An extra acceleration of at least four times when compared to previous existing preconditioning methods is found from experiments on a dataset.
منابع مشابه
A Straightforward Preprocessing Approach for Accelerating Convex Hull Computations on the GPU
An effective strategy for accelerating the calculation of convex hulls for point sets is to filter the input points by discarding interior points. In this paper, we present such a straightforward and efficient preprocessing approach by exploiting the GPU. The basic idea behind our approach is to discard the points that locate inside a convex polygon formed by 16 extreme points. Due to the fact ...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملEffects of Feeding Soybean Hulls on Calf Performance During Preconditioning
Soybean hulls (SBH) and soybean meal (SBM) were evaluated as potential supplements for preconditioning beef calves in Florida. Weaned calves were fed 4.76 lb/hd/d as fed of SBH or 1.40 lb/hd/d as fed of SBM for a 42-d preconditioning period. Calves fed SBH yielded higher preconditioning weight gains than calves supplemented with SBM (34.8 lb/ hd vs 22.3 lb/hd). An economic evaluation of precond...
متن کاملStratifying High Dimensional Data Based on Proximity to the Convex Hull Boundary
The convex hull of a set of points, C, serves to expose extremal properties of C and can help identify elements in C of high interest. For many problems, particularly in the presence of noise, the true vertex set (and facets) may be difficult to determine. One solution is to expand the list of high interest candidates to points lying near the boundary of the convex hull. We propose a quadratic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1505.00914 شماره
صفحات -
تاریخ انتشار 2015